Equity Importance Modeling With Financial Network and Betweenness Centrality
نویسندگان
چکیده
Financial market has been investigated from many perspectives. The recent emerging financial network methods model the market as a network. The edge between two vertices, or two equities are modeled as the correlation coefficient of the return on the prices of two equities in a period. A common question one can pose is that how can we determine the importance of an equity in the market. From a financial perspective, market-cap is an indicator of importance. But what is its correspondence from a financial network point-of-view? Degree distribution is an intuitive answer. However, after investigating on the betweenness centrality, which is another importance measurement of the graph, we found a high correlation between the betweenness centrality and market-cap. Degree of a vertex, in our case, denotes the number of equities that are highly correlated to it, which shows its local importance and lacks the capability to reflect its importance from a market-wide view. However, betweenness centrality of a vertex encodes global information. It measures the level to which a vertex is need by others along shortest path. In the experiment, we build a financial network using 473 stocks out of the SP-500 pool, during a one year period from June, 2008 to June, 2009. Betweenness centrality is calculated based on the known fasted Brandes algorithm. It is found that the average market-cap of the 20 stocks with largest degree is 29.0 billion dollars, slightly larger than that of the SP-500 stocks, which is 23.5 billion dollars. However, the average market-cap of the stocks with 20 largest betweenness is 50.5 billion dollars, more than twice of the SP500’s average market-cap. The market-cap-betweenness plots also shows an upward tendency, meaning that betweenness values are positive correlated with the market-caps, while the market-cap-degree plots doesn’t show such phenomenon.
منابع مشابه
A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملPairwise Co-betweenness for Several Types of Network
Vertex betweenness centrality is essential in the analysis of social and information networks, and it quantify vertex importance in terms of its quantity of information along geodesic paths in network. Edge betweenness is similar to the vertex betweenness. Co-betweenness centrality is a natural developed notion to extend vertex betweenness centrality to sets of vertices, and pairwise co-between...
متن کاملUse and Usefulness of Social Network Analysis in the Primary Health Context
Background and Objectives: While social network analysis has left a remarkable practical impact in the healthcare field, the potential implication of this methodology in the primary health domain is poorly researched. Hence, this study aimed to explore the use and usefulness social network analysis in the context of primary health care. Methods: The health volunteers of Imam Ali Health Center...
متن کاملAnalyzing the Collaboration Network of Global Scientific Outputs in the Field of Bibliotherapy in the Web of Science Database
Background and Aim: Bibliotherapy is a useful treatment for the prevention and treatment of mental disorders and has led to the formation of many scientific publications in this field. The purpose of this study was to investigate the publication trends in the field of bibliotherapy and visualize the structure of its scientific collaborations based on the Web of Science database during the perio...
متن کاملBetter Approximation of Betweenness Centrality
Estimating the importance or centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications, e.g., social network analysis or route planning. Since exact computation is prohibitive for large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010